Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count
نویسندگان
چکیده
منابع مشابه
Constructing subset partition graphs with strong adjacency and end-point count properties
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study howcertain combinatorial properties of such graphsmay be achieved in lower bound constructions. Using Lovász’ Local Lemma, we give a general randomized construction for subset partition graphs satisfying strong adjacency and end-point count properties. This can be used as a ...
متن کاملOn the Strong Partition Dimension of Graphs
We present a new style of metric generator in graphs. Specifically we introduce a metric generator based on a partition of the vertex set of a graph. The sets of the partition will work as the elements which will uniquely determine the position of each single vertex of the graph. A set W of vertices of a connected graph G strongly resolves two different vertices x, y / ∈ W if either dG(x,W ) = ...
متن کاملSubset selection in dimension reduction methods
Dimension reduction methods play an important role in multivariate statistical analysis, in particular with high-dimensional data. Linear methods can be seen as a linear mapping from the original feature space to a dimension reduction subspace. The aim is to transform the data so that the essential structure is more easily understood. However, highly correlated variables provide redundant infor...
متن کاملStrong Chromatic Index in Subset Graphs
The strong chromatic index of a graph G, denoted sq(G), is the minimum number of parts needed to partition the edges of G into induced matchings. For 0 5 k 5 1 5 m, the subset graph S,(k, 1) is a bipartite graph whose vertices are the kand 1-subsets of an m element ground set where two vertices are adjacent if and only if one subset is contained in the other. We show that sq(Sm(k, 1 ) ) = (&) a...
متن کاملOn the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results
The metric dimension is quite a well-studied graph parameter. Recently, the adjacency metric dimension and the local metric dimension have been introduced. We combine these variants and introduce the local adjacency metric dimension. We show that the (local) metric dimension of the corona product of a graph of order n and some non-trivial graph H equals n times the (local) adjacency metric dime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2017
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-016-3327-8